Short-Term Recurrence Krylov Subspace Methods for Nearly Hermitian Matrices
نویسندگان
چکیده
The Progressive GMRES algorithm, introduced by Beckermann and Reichel in 2008, is a residual-minimizing short-recurrence Krylov subspace method for solving a linear system in which the coefficient matrix has a low-rank skew-Hermitian part. We analyze this algorithm, observing a critical instability that makes the method unsuitable for some problems. To work around this issue we introduce a different short-term recurrence method based on Krylov subspaces for such matrices, which can be used as either a solver or a preconditioner. Numerical experiments compare this method to alternative algorithms.
منابع مشابه
On Short Recurrences in Optimal Krylov Subspace Solvers:
To solve large sparse linear systems of equations computational fast methods are preferable above methods such as GMRES. By exploiting structure of the involved matrix one can in certain cases use short recurrences to create an optimal Krylov subspace method. In this report we explain some of the theory regarding short-recurrence methods for solving linear systems. A central object in this theo...
متن کاملShort recurrences for computing extended Krylov bases for Hermitian and unitary matrices
It is well known that the projection of a matrix A onto a Krylov subspace span { h, Ah, Ah, . . . , Ak−1h } results in a matrix of Hessenberg form. We show that the projection of the same matrix A onto an extended Krylov subspace, which is of the form span { A−krh, . . . , A−2h, A−1h,h, Ah, Ah . . . , A`h } , is a matrix of so-called extended Hessenberg form which can be characterized uniquely ...
متن کاملMultiple Recurrences and the Associated Matrix Structures Stemming From Normal Matrices
There are many classical results in which orthogonal vectors stemming from Krylov subspaces are linked to short recurrence relations, e.g., three-terms recurrences for Hermitian and short rational recurrences for unitary matrices. These recurrence coefficients can be captured in a Hessenberg matrix, whose structure reflects the relation between the spectrum of the original matrix and the recurr...
متن کاملA nested Krylov subspace method for the overlap operator
We present a novel method to compute the overlap Dirac operator at zero and nonzero quark chemical potential. To approximate the sign function of large, sparse matrices, standard methods project the operator on a much smaller Krylov subspace, on which the matrix function is computed exactly. However, for large lattices this subspace can still be too large for an efficient calculation of the sig...
متن کاملDeliberate Ill-conditioning of Krylov Matrices Deliberate Ill-conditioning of Krylov Matrices
This paper starts oo with studying simple extrapolation methods for the classical iteration schemes such as Richardson, Jacobi and Gauss-Seidel iteration. The extrapolation procedures can be interpreted as approximate minimal residual methods in a Krylov subspace. It seems therefore logical to consider, conversely, classical methods as pre-processors for Krylov subspace methods, as was done by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 33 شماره
صفحات -
تاریخ انتشار 2012